large integer
英
美
[网络] 大整数；大数运算
双语例句
- Assign a large integer to each of the constituent words of the input service name.
为输入服务名的每个组件字指定一个较大的整数。 - Large integer operations than floating-point operations by the effective figure Austrian watch a lot of many to support the1000, but also more!
大的整数运算，比浮点运算所看奥的有效数字多了很多，支持1000位，还可更多！ - A special equation is constructed based on large integer factoring problem ( LIFP) and a parameter is introduced to transfer service private-key.
基于大整数分解困难问题构造一个特殊等式，并引进一个参数传递服务密钥。 - A High Performance Large Integer Modular Arithmetic Unit and Its Applications
一种高性能大数模运算单元及其应用 - Therefore, we should choose a large integer n.
所以大家要选择大整数n。 - They are constructed respectively from seeking inverse, modular multiplication and square of large integer, which remarkably reduce the time-complication of traditional Montgomery algorithm and improve the encryption and decryption rate of RSA algorithm.
分别对求逆元、模乘以及大整数平方运算构造了相应的快速算法，大大降低了传统Montgomery算法的时间复杂度，从而提高了RSA算法的加解密速度。 - Large Integer Multiplication in SIMD-LA
SIMD-LA模型上的大整数乘法 - An improved scheme is proposed by using LIFP ( Large Integer Factoring Problem) and service parameter.
利用大整数分解困难问题LIFP（LargeIntegerFactoringProblem）和服务参数提出了一个改进的Mu方案。 - A fixed window algorithm, which uses 2 representation for large integer and acceptable computations, can greatly reduce the number of points addition, so the efficiency of the scalar multiplication in elliptic curves can be improved.
固定窗口算法利用大整数的2进制表示和适量的预计算，减少椭圆曲线上点的加法运算，从而加快椭圆曲线上点的数乘的运算速度。 - Applying Link List in C Language to Solve Precision of Large Integer Operation
用C语言链表解决大整数运算的精度问题 - With the development of the method of large integer factorization and technique of parallel computing, the size of RSA key has to become bigger and bigger and then the RSA based system becomes slower and slower.
随着大整数分解方法和并行计算技术的发展，迫使RSA所需用的密钥将愈来愈长，于是采用RSA的系统的速度变得愈来愈慢。 - Optimization of the Quadratic Sieve in large integer factorization
大整数因子分解中的二次筛法优化 - In this paper, we carry out a research on large integer multiplier-the main parts of the Modular Multiplication, present a corresponding idea of the traditional multiplier and give the method of implementation on hardware.
本文对模乘部分的核心部件大数乘法器进行了研究，并给出平行四边形大数乘法器的设计思想与硬件实现方法。 - In this paper, the basic algorithm and thoughts of the realization of four arithmetic operations of large integer with Visual Basic are introduced; two large prime number samples are given.
介绍了用计算机程序实现任意位数大整数四则运算的基本算法思想，给出了利用我们的算法得到的两个大素数。 - In this article we study the quadratic sieve in large integer factorization, declare a kind of optimization in choosing algorithms, parameters, hardware and the control of courses, which in turn influence the safety of RSA Cryptosystem directly, and enhance the development of information safety.
本文研究了大整数因子分解中的二次筛法，提出了算法选择，参数选择，硬件选取和过程控制上的优化途径，直接影响RSA密码系统，推动信息安全的发展。 - The Algorithm Design of Large Integer Operation of Digital Signature with DSP
数字签名中大整数运算的DSP实现算法设计 - On the representation of large integer as a sum of a prime and an almost prime
表整数为素数及殆素数之和条件结果 - The Design and Implementation on Hardware of large integer Multiplier
大数乘法器的设计与硬件实现 - Based on the traditional Montgomery algorithm, this paper uses fast square of large integer multiplication and proposes an improved scheme, which remarkably reduces the time of large modular multiplication and improves the encryption and decryption rate of RSA algorithm.
本文在传统的Montgomery算法的基础上，利用快速大整数平方运算，提出了Montgomery算法的一种改进方案，有效缩短了大数模幂运算的时间，从而提高了RSA算法的加解密速度。 - Describing a traitor tracing scheme and an efficient Pay-TV scheme both are based on large integer factoring problem in depth.
介绍了一个基于大整数分解的叛逆者追踪方案和一个有效的付费电视方案，对两个相关方案分别进行了深入的研究和性能分析； - That breaking the new cryptosystem is equivalent to factoring a general large integer have been showed. A new digital signature scheme and a new authentic encryption scheme have been designed.
指出这种新的公钥密码体制的安全性建立在一般形式的素因子分解问题之上，并设计一种新的数字签名方案和认证加密方案。 - Its security is based on the difficulty of large integer factorization. According to the algorithm theory, we selected a large integer must be a safety requirements of large prime numbers.
其安全性基于大整数分解的难度，根据其算法原理，我们所选取的大整数必须是符合安全要求的大素数。 - The collusion-resistance security is proved as well.8.An identity-based broadcast encryption scheme based on the difficulty of large integer factoring problem is proposed.
证明了该方案在任意用户合谋攻击下的安全性。8.基于大整数分解困难问题提出了一个基于身份的群密钥分发方案。 - In order to improve the level of security and efficiency of the system, a new remote password authentication scheme applications in the system, which is based on the secure one-way hash function and large integer factorization problem.
为了提高系统的安全级和效率，将一种新的远程口令认证方案应用在系统中，它基于安全单向哈希函数和大整数分解问题。 - Bilinear pairing has recently become an important constructive tool in cryptography. It is widely exploited for devising cryptographic systems previously difficult in the context of large integer factorization and discrete logarithm or improving the existing schemes.
近年来，双线性对成为一种重要的密码学工具，用于设计一些在传统大整数分解和离散对数环境下难于实现的密码系统，或者用于提高现有系统的效率。 - Quantum computing has posed a great treat to the security of traditional public-key cryptosystems based on large integer factorization or discrete logarithm problems, the design of cryptosystem based on new hard problems is more important than ever.
量子计算对基于大整数因子分解和离散对数的传统公钥密码体制的安全性构成巨大威胁，设计基于新型困难问题密码算法被提升到一个前所未有的高度。 - Based on public-key cryptosystem based on the problems generally fall into three categories: large integer decomposition of the problem, discrete logarithm problem category, Elliptic Curve category.
公钥密码体制根据其所依据的难题一般分为三类：大整数分解问题类、离散对数问题类、椭圆曲线类。 - Existed PKI systems are mostly based on the RSA algorithm, and the RSA algorithm is proposed based on the mathematics of large integer decomposition problems. The process of calculation is very complicated and slow.
现存的PKI体系大多是基于RSA公钥算法实现的，RSA公钥算法是基于数学中的大整数分解难题提出的，其计算过程非常复杂，计算速度慢。 - NTL is a GNU library and the source code is open for us. It can operate large integer and univariate polynomials, unlucky, it only has the univariate polynomial factorization, no multivariate polynomial factorization.
NTL库是开放源代码的自由软件库，它提供了大整数的运算，一元多项式的运算等，遗憾的是，它只提供了一元多项式因式分解，没有提供多元多项式因式分解。 - At the same time, the security of the algorithm is mainly based on the double difficulties of solving large integer factorization and discrete logarithm problems, thus it has a high level of security.
同时该算法的安全性主要基于大整数的分解和离散对数求解的双重困难性问题上，因而具有更高的安全性，并用实例验证了算法的可行性。